Polynomial-Time Algorithms for Finding Elements of Prime Order and Sylow Subgroups
نویسنده
چکیده
The study of polynomial-time algorithms for groups has only recently begun. Only a few of the basic, elementary concepts or results of group theory are presently known to have polynomial-time versions. For example, ]G] can be found in polynomial time (Sims [22], Furst, Hopcroft, and Luks [9]), as can the centralizer of a normal subgroup of G (Luks [17]) and a composition series for G (Luks [16]). It was the latter result that motivated the present work. Its proof depended on the recently completed, monumental classification of all finite simple groups. Namely, Luks outlined an
منابع مشابه
Finding Sylow Normalizers in Polynomial Time
Given a set r of permutations of an n-set, let G be the group of permutations generated by r. I f p is any prime, it is known that a Sylow p-subgroup P of G can be found in polynomial time. We show that the normalizer of P can also be found in polynomial time. In particular, given two Sylow p-subgroups of G, all elements conjugating one to the other can be found (as a coset of the normalizer of...
متن کاملSylow's Theorem in Polynomial Time
Given a set r of permutations of an n-set, let G be the group of permutations generated by f. If p is a prime, a Sylow p-subgroup of G is a subgroup whose order is the largest power of p dividing IGI. For more than 100 years it has been known that a Sylow p-subgroup exists, and that for any two Sylow p-subgroups PI, P, of G there is an element go G such that Pz = g-‘PI g. We present polynomial-...
متن کاملFinite groups with $X$-quasipermutable subgroups of prime power order
Let $H$, $L$ and $X$ be subgroups of a finite group$G$. Then $H$ is said to be $X$-permutable with $L$ if for some$xin X$ we have $AL^{x}=L^{x}A$. We say that $H$ is emph{$X$-quasipermutable } (emph{$X_{S}$-quasipermutable}, respectively) in $G$ provided $G$ has a subgroup$B$ such that $G=N_{G}(H)B$ and $H$ $X$-permutes with $B$ and with all subgroups (with all Sylowsubgroups, respectively) $...
متن کاملNew characterization of some linear groups
There are a few finite groups that are determined up to isomorphism solely by their order, such as $mathbb{Z}_{2}$ or $mathbb{Z}_{15}$. Still other finite groups are determined by their order together with other data, such as the number of elements of each order, the structure of the prime graph, the number of order components, the number of Sylow $p$-subgroups for each prime $p$, etc. In this...
متن کاملPolynomial-Time Versions of Sylow's Theorem
Let G be a subgroup of S,, given in terms of a generating set of permutations, and let p be a prime divisor of 1 G 1. If G is solvable-and, more generally, if the nonabelian composition factors of G are suitably restricted-it is shown that the following can be found in polynomial time: a Sylow p-subgroup of G containing a given p-subgroup, and an element of G conjugating a given Sylow p-subgrou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 6 شماره
صفحات -
تاریخ انتشار 1985